363 research outputs found

    Cystic meningioangiomatosis with enhancing mural nodule on MRI and no calcification on CT

    Get PDF
    The neuroradiological features of meningioangiomatosis (MA) are non-specific. We report a young man with sporadic MA. The plain computerized tomography (CT) demonstrated a deep located right cystic lesion without calcification. On magnetic resonance imaging, the cystic mass lesion was confirmed with a mural nodule with significant enhancement on contrast-enhanced images

    Breakout local search for the Steiner tree problem with revenue, budget and hop constraints

    Get PDF
    The Steiner tree problem (STP) is one of the most popular combinatorial optimization problems with various practical applications. In this paper, we propose a Breakout Local Search (BLS) algorithm for an important generalization of the STP: the Steiner tree problem with revenue, budget and hop constraints (STPRBH), which consists of determining a subtree of a given undirected graph which maximizes the collected revenues, subject to both budget and hop constraints. Starting from a probabilistically constructed initial solution, BLS uses a Neighborhood Search (NS) procedure based on several specifically designed move operators for local optimization, and employs an adaptive diversification strategy to escape from local optima. The diversification mechanism is implemented by adaptive perturbations, guided by dedicated information of discovered high-quality solutions. Computational results based on 240 benchmarks show that BLS produces competitive results with respect to several previous approaches. For the 56 most challenging instances with unknown optimal results, BLS succeeds in improving 49 and matching one best known results within reasonable time. For the 184 instances which have been solved to optimality, BLS can also match 167 optimal results

    Dynamic programming driven memetic search for the Steiner tree problem with revenues, budget and hop constraints

    Get PDF
    We present a highly effective dynamic programming driven memetic algorithm for the Steiner tree problem with revenues, budget, and hop constraints (STPRBH), which aims at determining a subtree of an undirected graph, so as to maximize the collected revenue, subject to both budget and hop constraints. The main features of the proposed algorithm include a probabilistic constructive procedure to generate initial solutions, a neighborhood search procedure using dynamic programming to significantly speed up neighborhood exploration, a backbone-based crossover operator to generate offspring solutions, as well as a quality-and-distance updating strategy to manage the population. Computational results based on four groups of 384 well-known benchmarks demonstrate the value of the proposed algorithm, compared to the state of the art approaches. In particular, for the 56 most challenging instances with unknown optima, our algorithm succeeds in providing 45 improved best known solutions within a short computing time. We additionally provide results for a group of 30 challenging instances that are introduced in the paper. We provide a complexity analysis of the proposed algorithm and study the impact of some ingredients on the performance of the algorithm

    Swap-vertex based neighborhood for Steiner tree problems

    Get PDF
    Steiner tree problems (STPs) are very important in both theory and practice. In this paper, we introduce a powerful swap-vertex move operator which can be used as a basic element of any neighborhood search heuristic to solve many STP variants. Given the incumbent solution tree T, the swap-vertex move operator exchanges a vertex in T with another vertex out of T, and then attempts to construct a minimum spanning tree, leading to a neighboring solution (if feasible). We develop a series of dynamic data structures, which allow us to efficiently evaluate the feasibility of swap-vertex moves. Additionally, in order to discriminate different swap-vertex moves corresponding to the same objective value, we also develop an auxiliary evaluation function. We present a computational assessment based on a number of challenging problem instances (corresponding to three representative STP variants) which clearly shows the effectiveness of the techniques introduced in this paper. Particularly, as a key element of our KTS algorithm which participated in the 11th DIMACS implementation challenge, the swap-vertex operator as well as the auxiliary evaluation function contributed significantly to the excellent performance of our algorithm

    Knowledge-guided local search for the prize-collecting Steiner tree problem in graphs

    Get PDF
    The prize-collecting Steiner tree problem in graphs (PCSPG), as well as its rooted variant (RPCST), are target problems of the 11th DIMACS (the Center for Discrete Mathematics and Theoretical Computer Science) Implementation Challenge held in collaboration with ICERM (the Institute for Computational and Experimental Research in Mathematics). To solve these two problems, this paper proposes a knowledge-guided local search algorithm (K-ILS), 1 which integrates dedicated search strategies and explores structure information of problem instances. K-ILS uses an effective swap-vertex operator for tree transformation associated with a discriminating auxiliary evaluation function as well as several knowledge-guided perturbation strategies. K-ILS additionally employs two new path-based move operators to generate neighboring solutions. The computational results achieved on the benchmark instances of the 11th DIMACS Implementation Challenge using the same computing platform and competition rules demonstrate that K-ILS performs very well compared to the leading algorithms of the challenge. We report additional experiments to analyze the impact of the key components to the performance of the proposed algorithm

    Dynamic and Postdeformation Recrystallization of Nuclear-Grade 316LN Stainless Steel

    No full text
    Nuclear-grade 316LN stainless steel was subjected to single and double compressions at 1173–1473 K and strain rates of 0.01–10 s⁻¹. The dynamic and postdeformation recrystallization was investigated through analysis of the stress–strain curves and microstructure evolution. The thermal deformation equation and the quantitative relationships between the critical stress for the initiation of dynamic recrystallization and the Zener–Hollomon parameter, Z, and between the dynamic recrystallization grain size D and Z were derived. Dynamic recrystallization developed through an ordinary mechanism at low Z values and through a necklace mechanism at high Z values, with a critical Z value of about 3.6 10¹⁶ . At 1273–1473 K, softening of 316LN stainless steel after deformation was characterized by an Avrami-type equation, where the Avrami parameter, n, has no appreciable temperature dependence, and an average value of n and the activation energy, Qrex , were 0.68 and 129 kJ/mol, respectively.Нержавеющая сталь 316LN ядерного класса подвергалась одно- и двукратному сжатию при 1173...1473 К и скорости деформации 0,01...10 с⁻¹. Динамическая и постдеформационная рекристаллизация изучалась с помощью анализа зависимости деформации от напряжения и развития микроструктуры. Были выведены уравнение тепловой деформации и количественные зависимости между критическим напряжением инициирования динамической рекристаллизации и параметром Зенера Холломона Z, а также между размером зерна D при динамической рекристаллизации и Z. Динамическая рекристаллизация развивалась по обычному механизму при низких значениях Z и по механизму ожерелья при высоких значениях Z, при критическом значении Z примерно 3 6 10¹⁶. При 1273...1473 К разупрочнение нержавеющей стали 316LN после деформирования описывается уравнением Аврами, где параметр Аврами n не проявляет выраженной температурной зависимости, а его среднее значение и энергия активации Qrex составляют 0,68 и 129 кДж/моль соответственно

    Transpolar arc observation after solar wind entry into the high-latitude magnetosphere

    No full text
    Recently, Cluster observations have revealed the presence of new regions of solar wind plasma entry at the high-latitude magnetospheric lobes tailward of the cusp region, mostly during periods of northward interplanetary magnetic field. In this study, observations from the Global Ultraviolet Imager (GUVI) experiment on board the TIMED spacecraft and Wideband Imaging Camera imager on board the IMAGE satellite are used to investigate a possible link between solar wind entry and the formation of transpolar arcs in the polar cap. We focus on a case when transpolar arc formation was observed twice right after the two solar wind entry events were detected by the Cluster spacecraft. In addition, GUVI and IMAGE observations show a simultaneous occurrence of auroral activity at low and high latitudes after the second entry event, possibly indicating a two-part structure of the continuous band of the transpolar arc

    Analysis of Gas Nitriding Characteristics under Different Cold Hardening and Nitriding Pressure Conditions for Low-Carbon Low-Alloy Steel

    No full text
    A new approach to quick preparation of a nitrided case for low-carbon low-alloy steels was proposed. It is based on cold hardening and pressurized gas nitriding. The microstructure, surface hardness, thickness, and corrosion resistance of the nitrided layer on low-carbon low-alloy steel (20CrMnTi) were investigated after the nitriding at 510°C for 5 h under different cold rolling reduction (0–60% CR) and nitriding pressure (1–5 atm).Предложен новый способ получения азотированного слоя на малоуглеродистых низколегированных сталях с использованием холодного деформирования и газового азотирования давлением. Изучены микроструктура, поверхностная твердость, толщина и коррозионная стойкость азотированного слоя на стали 20CrMnTi после азотирования при 510°С в течение 5 ч в различных условиях обжатия при холодной прокатке (0-60% СR) и давлении азотирования (1-5 атм)

    Solar wind pressure pulse‐driven magnetospheric vortices and their global consequences

    Full text link
    We report the in situ observation of a plasma vortex induced by a solar wind dynamic pressure enhancement in the nightside plasma sheet using multipoint measurements from Time History of Events and Macroscale Interactions during Substorms (THEMIS) satellites. The vortex has a scale of 5–10 Re and propagates several Re downtail, expanding while propagating. The features of the vortex are consistent with the prediction of the Sibeck (1990) model, and the vortex can penetrate deep (~8 Re ) in the dawn‐dusk direction and couple to field line oscillations. Global magnetohydrodynamics simulations are carried out, and it is found that the simulation and observations are consistent with each other. Data from THEMIS ground magnetometer stations indicate a poleward propagating vortex in the ionosphere, with a rotational sense consistent with the existence of the vortex observed in the magnetotail. Key Points Solar wind pressure pulse‐driven vortex was observed in the magnetosphere Simulation and ground magnetic field data confirm this tailward moving vortex The vortex can penetrate deep inside the tail plasma sheet and couple to FLRsPeer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/107999/1/jgra51112.pd

    Quantum Step Heights in Hysteresis Loops of Molecular Magnets

    Full text link
    We present an analytical theory on the heights of the quantum steps observed in the hysteresis loops of molecular magnets. By considering the dipolar interaction between molecular spins, our theory successfully yields the step heights measured in experiments, and reveals a scaling law for the dependence of the heights on the sweeping rates hidden in the experiment data on Fe8_8 and Mn4_4. With this theory, we show how to accurately determine the tunnel splitting of a single molecular spin from the step heights.Comment: 4 pages, 5 figure
    corecore